# -*- coding: UTF-8 -*-
from typing import List
from leetcode_helper import TestcaseHelper, SolutionBase


class Solution(SolutionBase):
    # 解题的方法，命名和Leetcode的保持一致即可
    def numSquaresTwoLoop(self, n: int) -> int:
        square_number = 1
        while square_number * square_number <= n:
            square_number += 1

        if square_number * square_number > n:
            square_number -= 1

        int_max = 2 ** 31
        dp = [[int_max] * (n + 1) for _ in range(square_number + 1)]

        for i in range(square_number + 1):
            dp[i][0] = 0

        for i in range(1, square_number + 1):
            for j in range(1, n + 1):
                if j >= i * i and dp[i][j - i * i] != int_max:
                    dp[i][j] = min(dp[i-1][j], dp[i][j - i * i] + 1)
                else:
                    dp[i][j] = dp[i-1][j]

        return dp[square_number][n]

    def numSquares(self, n: int) -> int:
        square_number = 1
        while square_number * square_number <= n:
            square_number += 1

        if square_number * square_number > n:
            square_number -= 1

        int_max = 2 ** 31
        dp = [int_max] * (n + 1)
        dp[0] = 0

        for i in range(1, square_number + 1):
            for j in range(1, n + 1):
                if j >= i * i and dp[j - i*i] != int_max:
                    dp[j] = min(dp[j], dp[j - i*i] + 1)

        return dp[n]


if __name__ == '__main__':
    solution = Solution()

    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        (12, 3),
        (13, 2)
    ]

    for case_item in testcases:
        # 获取测试用的case和期待的执行结果
        input1 = case_item[0]
        expect = case_item[len(case_item) - 1]

        exec_result = solution.numSquares(input1)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)

